non-abelian sequenceable groups involving ?-covers

Non-Abelian Sequenceable Groups Involving ?-Covers

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...

non-divisibility for abelian groups

Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting   all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...

On Covers of Abelian Groups by Cosets

Let G be any abelian group and {asGs}ks=1 be a finite system of cosets of subgroups G1, . . . , Gk. We show that if {asGs} k s=1 covers all the elements of G at least m times with the coset atGt irredundant then [G : Gt] 6 2 and furthermore k > m + f([G : Gt]), where f( ∏ r i=1 p αi i ) = ∑ r i=1 αi(pi − 1) if p1, . . . , pr are distinct primes and α1, . . . , αr are nonnegative integers. This ...

More R-sequenceable Groups

On non-normal non-abelian subgroups of finite groups

‎In this paper we prove that a finite group $G$ having at most three‎ ‎conjugacy classes of non-normal non-abelian proper subgroups is‎ ‎always solvable except for $Gcong{rm{A_5}}$‎, ‎which extends Theorem 3.3‎ ‎in [Some sufficient conditions on the number of‎ ‎non-abelian subgroups of a finite group to be solvable‎, ‎Acta Math‎. ‎Sinica (English Series) 27 (2011) 891--896.]‎. ‎Moreover‎, ‎we s...

Sequenceable Groups and Related Topics

In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complete latin squares, Keedwell published a survey of all the available results concerning sequencings. This was updated (jointly with Dénes) in 1991 and a short overview, including results about complete mappings and Rsequencings, was given in the CRC Handbook of Combinatorial Designs in 1995. In Sect...